The Complexity of Counting Surjective Homomorphisms and Compactions
نویسندگان
چکیده
A homomorphism from a graph G to a graph H is a function from the vertices of G to the vertices of H that preserves edges. A homomorphism is surjective if it uses all of the vertices of H and it is a compaction if it uses all of the vertices of H and all of the non-loop edges of H . Hell and Nešetřil gave a complete characterisation of the complexity of deciding whether there is a homomorphism from an input graph G to a fixed graph H . A complete characterisation is not known for surjective homomorphisms or for compactions, though there are many interesting results. Dyer and Greenhill gave a complete characterisation of the complexity of counting homomorphisms from an input graph G to a fixed graphH . In this paper, we give a complete characterisation of the complexity of counting surjective homomorphisms from an input graph G to a fixed graph H and we also give a complete characterisation of the complexity of counting compactions from an input graph G to a fixed graph H .
منابع مشابه
Homomorphisms are indeed a good basis for counting: Three fixed-template dichotomy theorems, for the price of one
Many natural combinatorial quantities can be expressed by counting the number of homomorphisms to a fixed relational structure. For example, the number of 3-colorings of an undirected graph $G$ is equal to the number of homomorphisms from $G$ to the $3$-clique. In this setup, the structure receiving the homomorphisms is often referred to as a template; we use the term template function to refer...
متن کاملNote on "The Complexity of Counting Surjective Homomorphisms and Compactions"
Focke, Goldberg, and Živný [4] prove a complexity dichotomy for the problem of counting surjective homomorphisms from a large input graph G without loops to a fixed graph H that may have loops. In this note, we give a short proof of a weaker result: Namely, we only prove the #P-hardness of the more general problem in which G may have loops. Our proof is an application of a powerful framework of...
متن کاملAutomatic continuity of surjective $n$-homomorphisms on Banach algebras
In this paper, we show that every surjective $n$-homomorphism ($n$-anti-homomorphism) from a Banach algebra $A$ into a semisimple Banach algebra $B$ is continuous.
متن کاملOn natural homomorphisms of local cohomology modules
Let $M$ be a non-zero finitely generated module over a commutative Noetherian local ring $(R,mathfrak{m})$ with $dim_R(M)=t$. Let $I$ be an ideal of $R$ with $grade(I,M)=c$. In this article we will investigate several natural homomorphisms of local cohomology modules. The main purpose of this article is to investigate when the natural homomorphisms $gamma: Tor^{R}_c(k,H^c_I(M))to kotim...
متن کاملDelzant’s variation on Scott Complexity
We give an exposition of Delzant’s ideas extending the notion of Scott complexity of finitely generated groups to surjective homomorphisms from finitely presented groups.
متن کامل